The negation of the statement " 72 is divisib | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let $p$ be the statement: "$72$ is divisible by $2$ and $3$".This can be written as $p = q \wedge r$,where $q$ is "$72$ is divisible by $2$" and $

Vedclass · Accepted Answer

$72$ is not divisible by $2$ or $72$ is not divisible by $3$

Vedclass · Answer

(A) Let $p$ be the statement: "$72$ is divisible by $2$ and $3$".This can be written as $p = q \wedge r$,where $q$ is "$72$ is divisible by $2$" and $r$ is "$72$ is divisible by $3$".The negation of a conjunction is given by De Morgan's Law: $\sim(q \wedge r) \equiv \sim q \vee \sim r$.Here,$\sim q$ is "$72$ is not divisible by $2$" and $\sim r$ is "$72$ is not divisible by $3$".Therefore,the negation is "$72$ is not divisible by $2$ or $72$ is not divisible by $3$".

The negation of the statement " $72$ is divisible by $2$ and $3$ " is

Similar Questions

The Boolean expression $(p$ $\Rightarrow q) \wedge (q$ $\Rightarrow \sim p)$ is equivalent to:

The contrapositive of the statement "If you will work,you will earn money" is ..... .

Negation of the statement "The payment will be made if and only if the work is finished in time." is

If the truth value of the statement $(P \wedge (\sim R)) \rightarrow ((\sim R) \wedge Q)$ is $F$,then the truth value of which of the following is $F$?

The negation of the statement,$\exists x \in A$ such that $x+5 > 8$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module